Word Operation Closure and Primitivity of Languages
نویسندگان
چکیده
Based on the general operation ◦ of words, called bw-operation, the notions of ◦-primitive words, ◦-closed languages, ◦-bases of languages and operationleft-quotient-closed languages are defined and investigated. These notions turn out to be generalizations of the classical notions of primitive words, plus-closed (star-closed) languages, minimal generating sets and deletion-closed languages. Properties of the set of all ◦-primitive words, the ◦-bases of non-empty languages, right ◦-residuals and operation-left-quotient closed languages are studied under the general concept of word operation. Properties of bi-catenation and related languages are discussed as examples and also by their own interests.
منابع مشابه
Generating the Pseudo-Powers of a Word
The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the...
متن کاملWord insertions and primitivity ∗
In this paper we consider relations between the operation of word insertion and primitivity. A necessary and sufficient condition under which the insertion u ← u of the word u into itself has maximum cardinality is obtained. The notion of insertion sequence is introduced and sufficient conditions under which an insertion sequence is a special type of language (regular, context-free, biprefix co...
متن کاملThe pseudopalindromic completion of regular languages
Pseudopalindromes are words that are fixed points for some antimorphic involution. In this paper we discuss a newer word operation, that of pseudopalindromic completion, in which symbols are added to either side of the word such that the new obtained words are pseudopalindromes. This notion represents a particular type of hairpin completion, where the length of the hairpin is at most one. We gi...
متن کاملSome operations preserving primitivity of words
We investigate some operations where essentially, from a given word w, the word ww′ is constructed where w′ is a modified copy of w or a modified mirror image of w. We study whether ww′ is a primitive word provided that w is primitive. For instance, we determine all cases with an edit distance of w and w′ at most 2 such that the primitivity of w implies the primitivity of ww′. The operations ar...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 8 شماره
صفحات -
تاریخ انتشار 2002